class DIGRAPH_REV_DIGRAPH_VIEW{NTP,GTP<$DIGRAPH{NTP}} < $DIGRAPH{NTP}
****
 A view of a digraph with all edges reversed. Unlike most other views, this view of the graph permits modification operations, which are translated into operations on the original graph. Care should be taken in operations that involved both the original graph and this view

Ancestors
$DIGRAPH{_} $RO_DIGRAPH{_} $GRAPH{_,_} $STR
$ELT{_} $ELT DIGRAPH_INCL{_} RO_DIGRAPH_INCL{_}

Descendants
DIGRAPH_REV_DIGRAPH_VIEW{_}


Public


Features
add_node(n: NTP): NTP
add_node: NTP
connect(e: DIEDGE{NTP})
connect(f,s: NTP) .. Included as connect
connect(f,s: NTP): SAME .. Included as connect
copy: $DIGRAPH{NTP} .. Included as copy
create(m:GTP): SAME
**** Create a subgraph of "m"
delete_node(n: NTP)
disconnect(e: DIEDGE{NTP})
disconnect(f,s: NTP) .. Included as disconnect
equals(g: $RO_DIGRAPH{NTP}):BOOL .. Included as equals
**** True if both have the same set of nodes and edges
has(n: NTP): BOOL .. Included as has
has_edge(e: DIEDGE{NTP}): BOOL
has_node(n: NTP): BOOL
is_empty: BOOL .. Included as is_empty
n_adjacent(n:NTP): INT .. Included as n_adjacent
n_edges: INT
n_incoming(n: NTP): INT
n_nodes: INT
n_outgoing(n: NTP): INT
size: INT .. Included as size
str: STR .. Included as str
**** Print out the graph using the bound routine "f" for the nodes

Iters
adjacent!(once n: NTP): NTP .. Included as adjacent!
**** Adjacent is aliased to "outgoing"
edge!: DIEDGE{NTP}
elt!: NTP .. Included as elt!
**** Returns the nodes of the graph
incoming!(once n: NTP): NTP
node!: NTP
outgoing!(once n: NTP): NTP

Private

node_str(n: NTP): STR .. Included as node_str
**** There should not be void nodes in the graph!
attr source:GTP;
attr source:GTP;
The Sather Home Page